Inapproximability of the Edge-Contraction Problem
نویسندگان
چکیده
For a property π on graphs, the edge-contraction problem with respect to π is defined as a problem of finding a set of edges of minimum cardinality whose contraction results in a graph satisfying the property π. This paper gives a lower bound for the approximation ratio for the problem for any property π that is hereditary on contractions and determined by biconnected components. key words: edge-contraction problem, NP-hard, approximation algorithm, approximability, connected vertex cover problem
منابع مشابه
Inapproximability of the Minimum Biclique Edge Partition Problem
For a graph G, a biclique edge partition SBP(G) is a collection of bicliques (complete bipartite subgraphs) Bi such that each edge of G is contained in exactly one Bi. The Minimum Biclique Edge Partition Problem (MBEPP) asks for SBP(G) with the minimum size. In this paper, we show that for arbitrary small > 0, (6053/6052 − )-approximation of MBEPP is NP-hard. key words: biclique, edge partition...
متن کاملInapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP
Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modulo cryptographic assumptions [4]. Here we give upper and lower bounds on the approximability of this problem utilizing only the common assumption P 6= NP, in the setup where the input is a finite language specified by a truth tabl...
متن کاملInapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove inapproximability results. We show that they have no polynomial time approximation scheme, unless NP-complete problems can be solved in randomized subexponential time. Furthermore, we show that the same techniques can b...
متن کاملDistance-Preserving Graph Contractions
Compression and sparsification algorithms are frequently applied in a preprocessing step before analyzing or optimizing large networks/graphs. In this paper we propose and study a new framework for contracting edges of a graph (merging vertices into super-vertices) with the goal of preserving pairwise distances as accurately as possible. Formally, given an edge-weighted graph, the contraction s...
متن کاملA Note on the Inapproximability of Induced Disjoint Paths
We study the inapproximability of the induced disjoint paths problem on an arbitrary n-node m-edge undirected graph, which is to connect the maximum number of the k sourcesink pairs given in the graph via induced disjoint paths. It is known that the problem is NP-hard to approximate within m 1 2 −ε for a general k and any ε > 0. In this paper, we prove that the problem is NP-hard to approximate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 89-A شماره
صفحات -
تاریخ انتشار 2006